Cardinal sums of linearly ordered groups
نویسندگان
چکیده
منابع مشابه
Linearly Ordered Topological Spaces
This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...
متن کاملSums of lexicographically ordered sets
We consider the problem of determining finite integer sets which are knapsack-solvable in linear time (that is, it is possible to determine in linear time, for any integer b, whether b can be expressed as a sum of distinct elements of that set) and where the largest element is as small as possible. We study the condition that the k-subsets (for fixed k) when lexicographically ordered have incre...
متن کاملAutomorphisms of Powers of Linearly Ordered Sets
Let I = ([0; 1];_;^; 0; 1), where _ and ^ are max and min, respectively. This algebra is the basic building block of fuzzy set theory and logic. Likewise, the algebra I = ([0; 1];_;^; 0; 1), where [0; 1] = f(a; b) : a; b 2 [0; 1], a bg, _, ^ are given coordinate-wise, and 0 and 1 are the bounds on [0; 1], is the relevant algebra for interval-valued fuzzy set theory and logic. A good share of th...
متن کاملParsing Using Linearly Ordered Phonological Rules
A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing algorithm would face by encoding into the form being parsed the ambiguities which arise during parsing. The algorithm has been implemented and tested on real langua...
متن کاملOn Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference relation on extended literals. This relation, a strict partial order, induces a partial order on extended answer sets. The preferred answer sets, i.e. those that are minimal w.r.t. the induced order, represent the solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1975
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1975.101353